0.06/0.12	% Problem    : Vampire---4.8_10441 : TPTP v0.0.0. Released v0.0.0.
0.06/0.13	% Command    : run_E %s %d THM
0.13/0.34	% Computer : n003.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1440
0.13/0.34	% WCLimit    : 180
0.13/0.34	% DateTime   : Mon Jul  3 13:10:46 EDT 2023
0.13/0.34	% CPUTime    : 
0.20/0.47	Running higher-order theorem provingRunning: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.Oy6cPKHmrx/Vampire---4.8_10441
0.20/0.47	# Version: 3.1pre001-ho
0.20/0.48	# Preprocessing class: HSSSSLSSSLSNFFN.
0.20/0.48	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.48	# Starting lpo6_lambda_fix with 900s (5) cores
0.20/0.48	# Starting post_as_ho8 with 180s (1) cores
0.20/0.48	# Starting post_as_ho3 with 180s (1) cores
0.20/0.48	# Starting post_as_ho2 with 180s (1) cores
0.20/0.48	# post_as_ho8 with pid 10623 completed with status 0
0.20/0.48	# Result found by post_as_ho8
0.20/0.48	# Preprocessing class: HSSSSLSSSLSNFFN.
0.20/0.48	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.48	# Starting lpo6_lambda_fix with 900s (5) cores
0.20/0.48	# Starting post_as_ho8 with 180s (1) cores
0.20/0.48	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
0.20/0.48	# Search class: HGHSF-FFSF21-SFFFMFNN
0.20/0.48	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.48	# Starting new_ho_10 with 98s (1) cores
0.20/0.48	# new_ho_10 with pid 10626 completed with status 0
0.20/0.48	# Result found by new_ho_10
0.20/0.48	# Preprocessing class: HSSSSLSSSLSNFFN.
0.20/0.48	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.48	# Starting lpo6_lambda_fix with 900s (5) cores
0.20/0.48	# Starting post_as_ho8 with 180s (1) cores
0.20/0.48	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
0.20/0.48	# Search class: HGHSF-FFSF21-SFFFMFNN
0.20/0.48	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.48	# Starting new_ho_10 with 98s (1) cores
0.20/0.48	# Preprocessing time       : 0.001 s
0.20/0.48	# Presaturation interreduction done
0.20/0.48	
0.20/0.48	# Proof found!
0.20/0.48	# SZS status Theorem
0.20/0.48	# SZS output start CNFRefutation
0.20/0.48	thf(decl_22, type, in: $i > $i > $o).
0.20/0.48	thf(decl_23, type, emptyset: $i).
0.20/0.48	thf(decl_24, type, setadjoin: $i > $i > $i).
0.20/0.48	thf(decl_25, type, foundationAx: $o).
0.20/0.48	thf(decl_26, type, setadjoinIL: $o).
0.20/0.48	thf(decl_27, type, setadjoinIR: $o).
0.20/0.48	thf(decl_28, type, in__Cong: $o).
0.20/0.48	thf(decl_29, type, upairset2E: $o).
0.20/0.48	thf(decl_30, type, esk1_1: $i > $i).
0.20/0.48	thf(decl_31, type, esk2_0: $i).
0.20/0.48	thf(decl_32, type, esk3_0: $i).
0.20/0.48	thf(notinself2, conjecture, ((foundationAx)=>(((setadjoinIR)=>((in__Cong)=>((upairset2E)=>![X1:$i, X3:$i]:(((in @ X1 @ X3)=>~((in @ X3 @ X1)))))))<=(setadjoinIL))), file('/export/starexec/sandbox2/tmp/tmp.Oy6cPKHmrx/Vampire---4.8_10441', notinself2)).
0.20/0.48	thf(setadjoinIL, axiom, ((setadjoinIL)<=>![X2:$i, X4:$i]:((in @ X2 @ (setadjoin @ X2 @ X4)))), file('/export/starexec/sandbox2/tmp/tmp.Oy6cPKHmrx/Vampire---4.8_10441', setadjoinIL)).
0.20/0.48	thf(setadjoinIR, axiom, ((setadjoinIR)<=>![X2:$i, X1:$i, X4:$i]:(((in @ X4 @ X1)=>(in @ X4 @ (setadjoin @ X2 @ X1))))), file('/export/starexec/sandbox2/tmp/tmp.Oy6cPKHmrx/Vampire---4.8_10441', setadjoinIR)).
0.20/0.48	thf(in__Cong, axiom, ((in__Cong)<=>![X1:$i, X3:$i]:((((X1)=(X3))=>![X2:$i, X4:$i]:((((X2)=(X4))=>((in @ X2 @ X1)<=>(in @ X4 @ X3))))))), file('/export/starexec/sandbox2/tmp/tmp.Oy6cPKHmrx/Vampire---4.8_10441', in__Cong)).
0.20/0.48	thf(upairset2E, axiom, ((upairset2E)<=>![X2:$i, X4:$i, X5:$i]:(((in @ X5 @ (setadjoin @ X2 @ (setadjoin @ X4 @ emptyset)))=>(((X5)=(X2))|((X5)=(X4)))))), file('/export/starexec/sandbox2/tmp/tmp.Oy6cPKHmrx/Vampire---4.8_10441', upairset2E)).
0.20/0.48	thf(foundationAx, axiom, ((foundationAx)<=>![X1:$i]:((?[X2:$i]:((in @ X2 @ X1))=>?[X3:$i]:(((in @ X3 @ X1)&~(?[X2:$i]:(((in @ X2 @ X3)&(in @ X2 @ X1))))))))), file('/export/starexec/sandbox2/tmp/tmp.Oy6cPKHmrx/Vampire---4.8_10441', foundationAx)).
0.20/0.48	thf(c_0_6, negated_conjecture, ~((![X24:$i]:((?[X25:$i]:((in @ X25 @ X24))=>?[X26:$i]:(((in @ X26 @ X24)&~(?[X27:$i]:(((in @ X27 @ X26)&(in @ X27 @ X24))))))))=>(![X38:$i, X39:$i]:((in @ X38 @ (setadjoin @ X38 @ X39)))=>(![X28:$i, X29:$i, X30:$i]:(((in @ X30 @ X29)=>(in @ X30 @ (setadjoin @ X28 @ X29))))=>(![X31:$i, X32:$i]:((((X31)=(X32))=>![X33:$i, X34:$i]:((((X33)=(X34))=>((in @ X33 @ X31)<=>(in @ X34 @ X32))))))=>(![X35:$i, X36:$i, X37:$i]:(((in @ X37 @ (setadjoin @ X35 @ (setadjoin @ X36 @ emptyset)))=>(((X37)=(X35))|((X37)=(X36)))))=>![X1:$i, X3:$i]:(((in @ X1 @ X3)=>~(in @ X3 @ X1))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[notinself2]), setadjoinIL]), setadjoinIR]), in__Cong]), upairset2E]), foundationAx])])).
0.20/0.48	thf(c_0_7, negated_conjecture, ![X40:$i, X41:$i, X43:$i, X44:$i, X45:$i, X46:$i, X47:$i, X48:$i, X49:$i, X50:$i, X51:$i, X52:$i, X53:$i, X54:$i, X55:$i]:(((((in @ (esk1_1 @ X40) @ X40)|~(in @ X41 @ X40))&(~(in @ X43 @ (esk1_1 @ X40))|~(in @ X43 @ X40)|~(in @ X41 @ X40)))&((in @ X44 @ (setadjoin @ X44 @ X45))&((~(in @ X48 @ X47)|(in @ X48 @ (setadjoin @ X46 @ X47)))&(((~(in @ X51 @ X49)|(in @ X52 @ X50)|((X51)!=(X52))|((X49)!=(X50)))&(~(in @ X52 @ X50)|(in @ X51 @ X49)|((X51)!=(X52))|((X49)!=(X50))))&((~(in @ X55 @ (setadjoin @ X53 @ (setadjoin @ X54 @ emptyset)))|(((X55)=(X53))|((X55)=(X54))))&((in @ esk2_0 @ esk3_0)&(in @ esk3_0 @ esk2_0)))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])).
0.20/0.48	thf(c_0_8, negated_conjecture, ![X2:$i, X1:$i]:(((in @ (esk1_1 @ X1) @ X1)|~((in @ X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.48	thf(c_0_9, negated_conjecture, ![X1:$i, X2:$i]:((in @ X1 @ (setadjoin @ X1 @ X2))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.48	thf(c_0_10, negated_conjecture, ![X1:$i, X3:$i, X2:$i]:((~((in @ X1 @ (esk1_1 @ X2)))|~((in @ X1 @ X2))|~((in @ X3 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.48	thf(c_0_11, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:((((X1)=(X2))|((X1)=(X3))|~((in @ X1 @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)))))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.48	thf(c_0_12, negated_conjecture, ![X1:$i, X2:$i]:((in @ (esk1_1 @ (setadjoin @ X1 @ X2)) @ (setadjoin @ X1 @ X2))), inference(spm,[status(thm)],[c_0_8, c_0_9])).
0.20/0.48	thf(c_0_13, negated_conjecture, ![X1:$i, X2:$i]:((~((in @ X1 @ (esk1_1 @ X2)))|~((in @ X1 @ X2)))), inference(condense,[status(thm)],[c_0_10])).
0.20/0.48	thf(c_0_14, negated_conjecture, ![X1:$i, X2:$i]:((((esk1_1 @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)))=(X1))|((esk1_1 @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)))=(X2)))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
0.20/0.48	thf(c_0_15, negated_conjecture, ![X1:$i, X3:$i, X2:$i]:((((esk1_1 @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)))=(X1))|~((in @ X3 @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset))))|~((in @ X3 @ X2)))), inference(spm,[status(thm)],[c_0_13, c_0_14])).
0.20/0.48	thf(c_0_16, negated_conjecture, ![X1:$i, X2:$i]:((((esk1_1 @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)))=(X1))|~((in @ X1 @ X2)))), inference(spm,[status(thm)],[c_0_15, c_0_9])).
0.20/0.48	thf(c_0_17, negated_conjecture, ![X1:$i, X3:$i, X2:$i]:(((in @ X1 @ (setadjoin @ X3 @ X2))|~((in @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.48	thf(c_0_18, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:((~((in @ X1 @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset))))|~((in @ X1 @ X2))|~((in @ X2 @ X3)))), inference(spm,[status(thm)],[c_0_13, c_0_16])).
0.20/0.48	thf(c_0_19, negated_conjecture, ![X1:$i, X2:$i]:((((X1)=(X2))|~((in @ X1 @ (setadjoin @ X2 @ emptyset))))), inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_17])])).
0.20/0.48	thf(c_0_20, negated_conjecture, ![X1:$i, X3:$i, X2:$i]:((~((in @ X1 @ (setadjoin @ X2 @ emptyset)))|~((in @ X1 @ X3))|~((in @ X3 @ X2)))), inference(spm,[status(thm)],[c_0_18, c_0_17])).
0.20/0.48	thf(c_0_21, negated_conjecture, ![X1:$i]:(((esk1_1 @ (setadjoin @ X1 @ emptyset))=(X1))), inference(spm,[status(thm)],[c_0_19, c_0_12])).
0.20/0.48	thf(c_0_22, negated_conjecture, ![X2:$i, X1:$i]:((~((in @ X1 @ X2))|~((in @ X2 @ X1)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_12]), c_0_21])).
0.20/0.48	thf(c_0_23, negated_conjecture, (in @ esk3_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.48	thf(c_0_24, negated_conjecture, (in @ esk2_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.48	thf(c_0_25, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24])]), ['proof']).
0.20/0.48	# SZS output end CNFRefutation
0.20/0.48	# Parsed axioms                        : 14
0.20/0.48	# Removed by relevancy pruning/SinE    : 8
0.20/0.48	# Initial clauses                      : 9
0.20/0.48	# Removed in clause preprocessing      : 2
0.20/0.48	# Initial clauses in saturation        : 7
0.20/0.48	# Processed clauses                    : 61
0.20/0.48	# ...of these trivial                  : 1
0.20/0.48	# ...subsumed                          : 15
0.20/0.48	# ...remaining for further processing  : 45
0.20/0.48	# Other redundant clauses eliminated   : 2
0.20/0.48	# Clauses deleted for lack of memory   : 0
0.20/0.48	# Backward-subsumed                    : 1
0.20/0.48	# Backward-rewritten                   : 1
0.20/0.48	# Generated clauses                    : 97
0.20/0.48	# ...of the previous two non-redundant : 76
0.20/0.48	# ...aggressively subsumed             : 0
0.20/0.48	# Contextual simplify-reflections      : 0
0.20/0.48	# Paramodulations                      : 93
0.20/0.48	# Factorizations                       : 2
0.20/0.48	# NegExts                              : 0
0.20/0.48	# Equation resolutions                 : 2
0.20/0.48	# Total rewrite steps                  : 18
0.20/0.48	# Propositional unsat checks           : 0
0.20/0.48	#    Propositional check models        : 0
0.20/0.48	#    Propositional check unsatisfiable : 0
0.20/0.48	#    Propositional clauses             : 0
0.20/0.48	#    Propositional clauses after purity: 0
0.20/0.48	#    Propositional unsat core size     : 0
0.20/0.48	#    Propositional preprocessing time  : 0.000
0.20/0.48	#    Propositional encoding time       : 0.000
0.20/0.48	#    Propositional solver time         : 0.000
0.20/0.48	#    Success case prop preproc time    : 0.000
0.20/0.48	#    Success case prop encoding time   : 0.000
0.20/0.48	#    Success case prop solver time     : 0.000
0.20/0.48	# Current number of processed clauses  : 36
0.20/0.48	#    Positive orientable unit clauses  : 8
0.20/0.48	#    Positive unorientable unit clauses: 0
0.20/0.48	#    Negative unit clauses             : 6
0.20/0.48	#    Non-unit-clauses                  : 22
0.20/0.48	# Current number of unprocessed clauses: 23
0.20/0.48	# ...number of literals in the above   : 59
0.20/0.48	# Current number of archived formulas  : 0
0.20/0.48	# Current number of archived clauses   : 9
0.20/0.48	# Clause-clause subsumption calls (NU) : 141
0.20/0.48	# Rec. Clause-clause subsumption calls : 127
0.20/0.48	# Non-unit clause-clause subsumptions  : 6
0.20/0.48	# Unit Clause-clause subsumption calls : 27
0.20/0.48	# Rewrite failures with RHS unbound    : 0
0.20/0.48	# BW rewrite match attempts            : 2
0.20/0.48	# BW rewrite match successes           : 1
0.20/0.48	# Condensation attempts                : 61
0.20/0.48	# Condensation successes               : 4
0.20/0.48	# Termbank termtop insertions          : 2366
0.20/0.48	
0.20/0.48	# -------------------------------------------------
0.20/0.48	# User time                : 0.008 s
0.20/0.48	# System time              : 0.001 s
0.20/0.48	# Total time               : 0.009 s
0.20/0.48	# Maximum resident set size: 1920 pages
0.20/0.48	
0.20/0.48	# -------------------------------------------------
0.20/0.48	# User time                : 0.010 s
0.20/0.48	# System time              : 0.003 s
0.20/0.48	# Total time               : 0.012 s
0.20/0.48	# Maximum resident set size: 1712 pages
0.20/0.48	% E---3.1 exiting
0.20/0.49	EOF